Independence of higher Kurepa hypotheses

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independence of higher Kurepa hypotheses

We study the Generalized Kurepa Hypothesis introduced by Chang. We show that relative to the existence of an inaccessible cardinal the Gap-n-Kurepa hypothesis does not follow from the Gap-m-Kurepa hypothesis for m different from n. The use of an inaccessible is necessary for this result.

متن کامل

Some Independence Results Related to the Kurepa Tree

By an !1{tree we mean a tree of power !1 and height !1 . Under the assumption of CH plus 21 > !2 we call an !1{tree a Jech{Kunen tree if it has many branches for some strictly between !1 and 2 !1 . We call an !1{tree being !1{anticomplete if it has more than !1 many branches and has no subtrees which are isomorphic to the standard !1{complete binary tree. In this paper we prove that: (1) It is ...

متن کامل

Separating a family of weak Kurepa Hypotheses and the Transversal Hypothesis

We investigate principles which fit between the Kurepa Hypothesis and the weak Kurepa Hypothesis.

متن کامل

Higher Order Independence in Matroids

One may regard vectors in a finite dimensional vector space as being linear forms in a polynomial ring in an obvious way. A collection of linear forms satisfying various linear dependence relations can become independent when each of the forms is raised to the k-th power. In this paper we prove that a certain class of matroids satisfies a " higher order " independence property of this kind. The...

متن کامل

Arithmetical independence results using higher recursion theory

We extend an independence result proved in [1]. We show that for all n, there is a special set of Πn sentences {φa}a∈H corresponding to elements of a linear ordering (H,<H) of order type ω CK 1 (1+ η). These sentences allow us to build completions {Ta}a∈H of PA such that for a <H b, Ta ∩Σn ⊂ Tb ∩Σn, with φa ∈ Ta, ¬φa ∈ Tb. Our method uses the Barwise–Kreisel Compactness Theorem. §

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archive for Mathematical Logic

سال: 2012

ISSN: 0933-5846,1432-0665

DOI: 10.1007/s00153-012-0286-7